A recursive formula for osculating curves

نویسندگان

چکیده

Let $X$ be a smooth complex projective variety. Using construction devised to Gathmann, we present recursive formula for some of the Gromov-Witten invariants $X$. We prove that, when is homogeneous, this gives number osculating rational curves at general point hypersurface This generalizes classical well known pairs inflexion (asymptotic) lines surfaces in $\mathbb{P}^{3}$ Salmon, as Darboux's $27$ conics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A mean value formula for elliptic curves

It is proved in this paper that for any point on an elliptic curve, the mean value of x-coordinates of its n-division points is the same as its x-coordinate.

متن کامل

a recursive formula for the number of fuzzy subgroups of finite cyclic groups

fuzzy groups and fuzzy theory have a lot of applications in several sciences such as mathematics, computer science, computer and electrical engineering. hence, counting the number of fuzzy subgroups of finite groups to classify them is an important issue in fuzzy theory. the main goal of this paper is to give an explicit formula for the number of fuzzy subgroups of a finite cyclic group g z p1 ...

متن کامل

a recursive formula for the number of fuzzy subgroups of finite cyclic groups

fuzzy groups and fuzzy theory have a lot of applications in several sciencessuch as mathematics, computer science, computer and electrical engineering.hence, counting the number of fuzzy subgroups of finite groups to classify them isan important issue in fuzzy theory. the main goal of this paper is to give an explicitformula for the number of fuzzy subgroups of a finite cyclic groupg z p1 z p 2...

متن کامل

On a recursive formula for the moments of phase noise

In this paper, we present a recursive formula for the moments of phase noise in communication systems. The phase noise is modeled using continuous Brownian motion. The recursion is simple and valid for an arbitrary initial phase value. The moments obtained by the recursion are used to calculate approximations to the probability density function of the phase noise, using orthogonal polynomial se...

متن کامل

A Recursive Formula for the Kolakoski Sequence A000002

We present a recursive formula for the nth term of the Kolakoski sequence. Using this formula, it is easy to find recursions for the number of ones in the first n terms and for the sum of the first n terms of the Kolakoski sequence.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Arkiv för Matematik

سال: 2021

ISSN: ['0004-2080', '1871-2487']

DOI: https://doi.org/10.4310/arkiv.2021.v59.n1.a7